Clustering Media Items Stemming from Multiple Social Networks

We have created and evaluated an algorithm capable of deduplicating and clustering exactand near-duplicate media items that get published and shared on multiple social networks in the context of events. This algorithm works in an entirely ad-hoc manner, without any pre-calculation. When people attend events, they more and more share event-related media items publicly on social networks to let their social network contacts relive and witness the attended events. In the past, we have worked on methods to accumulate such public user-generated multimedia content in order to summarize events visually, for example, in the form of media galleries or slideshows. In this paper, first, we introduce social-network-specific reasons and challenges that cause near-duplicate media items. Second, we detail an algorithm for the task of deduplicating and clustering exactand near-duplicate media items stemming from multiple social networks. Finally, we evaluate the algorithm’s strengths and weaknesses and show ways to address the weaknesses efficiently.